One-sided approximation and variational inequalities

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

One-Sided Approximation of Functions

where :Yl denotes the orthogonal complement of Y (see [I]). Another example of this type of duality appears in one of the classical moment problems. Letfbe Bore1 measurable and bounded on [a,b], h,, . . ., h, a CebySev system on [a,b] and for a given positive Bore1 measure yO defined on [a,b] denote by C (y,,) the class of all positive Bore1 measures y which satisfy f.bhkdy=[hkdyo k= 1,2 ,..., ...

متن کامل

An Approximation of Solutions of Variational Inequalities

It is known (see [5, 6]) that when K is a closed convex cone, problems NCP( f ,K) and VI( f ,K) are equivalent. To study the existence of solutions of the NCP( f ,K) and VI( f ,K) problems, many authors have used the techniques of KKM mappings, and the Fan-KKM theorem from fixed point theory (see [1, 5, 6, 7, 8, 9, 10]). In case B is a Hilbert space, Isac and other authors have used the notion ...

متن کامل

Norm Inequalities Relating One-sided Singular Integrals and the One-sided Maximal Function

In this paper we prove that if a weight w satisfies the C q condition, then the Lp(w) norm of a one-sided singular integral is bounded by the Lp(w) norm of the one-sided Hardy-Littlewood maximal function, for 1 < p < q <∞.

متن کامل

One-sided approximation by entire functions

Let f : R→ R have an nth derivative of finite variation Vf(n) and a locally absolutely continuous (n− 1)st derivative. Denote by E±(f, δ)p the error of onesided approximation of f (from above and below, respectively) by entire functions of exponential type δ > 0 in Lp(R)–norm. For 1 ≤ p ≤ ∞ we show the estimate E±(f, δ)p ≤ C n π1/pVf(n)δ −n− 1 p , with constants Cn > 0.

متن کامل

Computation of Best One - Sided Lx Approximation

A computational procedure based on linear programming is presented for finding the best one-sided Li approximation to a given function. A theorem which ensures that the computational procedure yields approximations which converge to the best approximation is proved. Some numerical examples are discussed.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the American Mathematical Society

سال: 1974

ISSN: 0002-9904

DOI: 10.1090/s0002-9904-1974-13477-4